On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs

For \(k \ge 2\), an ordered k-uniform hypergraph \(\mathcal {H}=(H,<)\) is a H together with fixed linear ordering < of its vertex set. The Ramsey number \(\overline{R}(\mathcal {H},\mathcal {G})\) two hypergraphs {H}\) and {G}\) the smallest Open image in new window such that every red-blue coloring hyperedges complete {K}^{(k)}_N\) contains blue copy or red {G}\).